Haskell Bookcamp by meap-version-4.html

Author:meap-version-4.html
Language: eng
Format: epub

Figure 4.1. A solution for "find" and "solution" in the modified ladder game

Not only does this modification allow us to find more creative solutions, but it makes the problem a bit harder to solve computationally. When solving this problem, we need to start thinking about performance and a clever way to minimize work that we do not have to do.

4.1.1 Graphing it out

Now, we can start thinking how to build an artificial intelligence for this kind of game. We assume that our intelligence somehow has a complete list of all English words. If it wants to find a valid chain, it needs to find a path from one word to the other with the valid transformation. For this we can assume all words to be arranged in a graph, where an edge between two words is present if and only if we can reach one word from the other in a single step, a single word being a node in the graph. Such a graph is shown in figure 4.2 for a few three letter words. As we can see, finding a chain from "cat" to "dog" can be done by finding a path within this graph.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.